Density of m-tuples with respect to polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine m-tuples for linear polynomials

In this paper, we prove that there does not exist a set with more than 26 polynomials with integer coefficients, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. 1991 Mathematics Subject Classification: 11D09.

متن کامل

Diophantine m-tuples for quadratic polynomials

In this paper, we prove that there does not exist a set with more than 98 nonzero polynomials in Z[X], such that the product of any two of them plus a quadratic polynomial n is a square of a polynomial from Z[X] (we exclude the possibility that all elements of such set are constant multiples of a linear polynomial p ∈ Z[X] such that p2|n). Specially, we prove that if such a set contains only po...

متن کامل

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

15 صفحه اول

DIOPHANTINE m-TUPLES FOR LINEAR POLYNOMIALS. II. EQUAL DEGREES

In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the...

متن کامل

Decomposition of Polynomials with Respect to the Cyclic Group of Order m

Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposition as a sum of m polynomials P [j](x) = P k αj,kx λj,k containing only exponents λj,k with λj,k+1 − λj,k = m, is considered. A general algorithm is proposed in order to build holonomic equations for the m-ary parts P [j](x) starting from the initial one, which, in addition, provides a factorized...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1985

ISSN: 0035-7596

DOI: 10.1216/rmj-1985-15-2-319